21![arXiv:1209.5993v4 [cs.CC] 11 SepGeometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether’s Normalization Lemma Dedicated to Sri Ra arXiv:1209.5993v4 [cs.CC] 11 SepGeometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether’s Normalization Lemma Dedicated to Sri Ra](https://www.pdfsearch.io/img/85b9fc7fb62e3f2367dee0d048b4ca8d.jpg) | Add to Reading ListSource URL: gct.cs.uchicago.eduLanguage: English - Date: 2013-11-07 17:14:04
|
---|
22![CPS296.2 Geometric Optimization February 22, 2007 Lecture 13: 1-Center, 1-Median problems Lecturer: Pankaj K. Agarwal CPS296.2 Geometric Optimization February 22, 2007 Lecture 13: 1-Center, 1-Median problems Lecturer: Pankaj K. Agarwal](https://www.pdfsearch.io/img/14a5109ab6f04a06f4eb5192c251382f.jpg) | Add to Reading ListSource URL: www.cs.duke.eduLanguage: English - Date: 2007-04-05 11:46:26
|
---|
23![Randomized Loose Renaming in O(log log n) Time [Extended Abstract] ∗ † Randomized Loose Renaming in O(log log n) Time [Extended Abstract] ∗ †](https://www.pdfsearch.io/img/304a82bdb46f0389e27319dd446afb61.jpg) | Add to Reading ListSource URL: cs-www.cs.yale.eduLanguage: English - Date: 2015-04-30 10:34:00
|
---|
24![Randomized Distributed Decision Pierre Fraigniaud1 , Amos Korman1? , Merav Parter2 , and David Peleg2?? 1 CNRS and University Paris Diderot, France . {pierre.fraigniaud,amos.korman}@liafa.jussieu.fr Randomized Distributed Decision Pierre Fraigniaud1 , Amos Korman1? , Merav Parter2 , and David Peleg2?? 1 CNRS and University Paris Diderot, France . {pierre.fraigniaud,amos.korman}@liafa.jussieu.fr](https://www.pdfsearch.io/img/90b215578b8576c3e330f4a3e1fc29da.jpg) | Add to Reading ListSource URL: www.liafa.jussieu.frLanguage: English - Date: 2012-10-01 06:03:40
|
---|
25![ Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) = Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) =](https://www.pdfsearch.io/img/f92504b39293720e2d922985faf6ed17.jpg) | Add to Reading ListSource URL: www.liafa.univ-paris-diderot.frLanguage: English - Date: 2015-01-19 07:51:43
|
---|
26![Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems arXiv:1012.4889v1 [cs.DS] 22 DecHossein Jowhari1 , Mert Sa˘glam1 , and G´abor Tardos1,2 Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems arXiv:1012.4889v1 [cs.DS] 22 DecHossein Jowhari1 , Mert Sa˘glam1 , and G´abor Tardos1,2](https://www.pdfsearch.io/img/9421749a7a2cec0703ad8d4196bb1854.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2010-12-22 20:04:48
|
---|
27![A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen† A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen†](https://www.pdfsearch.io/img/c08dcede4fd06201c6c3f467b00b8af5.jpg) | Add to Reading ListSource URL: files.oliverfriedmann.deLanguage: English - Date: 2012-02-10 07:43:15
|
---|
28![Noname manuscript No. (will be inserted by the editor) Faster Randomized Consensus With an Oblivious Adversary James Aspnes Noname manuscript No. (will be inserted by the editor) Faster Randomized Consensus With an Oblivious Adversary James Aspnes](https://www.pdfsearch.io/img/ea0e028e3ef7ade7dcdb728825b80b9f.jpg) | Add to Reading ListSource URL: cs-www.cs.yale.eduLanguage: English - Date: 2015-04-30 10:34:00
|
---|
29![ Exercise 1 (A streaming algorithm for the second moment of the frequencies). We are given a stream of numbers x1 , . . . , xn ∈ {0, . . . , m − 1} and we want to compute the sum of the squares of the frequencies of Exercise 1 (A streaming algorithm for the second moment of the frequencies). We are given a stream of numbers x1 , . . . , xn ∈ {0, . . . , m − 1} and we want to compute the sum of the squares of the frequencies of](https://www.pdfsearch.io/img/b065ac950f018a82e056c33337ae6964.jpg) | Add to Reading ListSource URL: www.liafa.univ-paris-diderot.frLanguage: English - Date: 2015-01-19 07:51:43
|
---|
30![Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2 Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2](https://www.pdfsearch.io/img/67b007ef56229c6f39c53c5b62ff1a85.jpg) | Add to Reading ListSource URL: cs-www.cs.yale.eduLanguage: English - Date: 2015-04-30 10:33:59
|
---|